Sparsity Regularized Affine Projection Adaptive Filtering for System Identification
نویسندگان
چکیده
منابع مشابه
Sparsity-Aware Affine Projection Algorithm for System Identification
This work presents a new type of the affine projection (AP) algorithms which incorporate the sparsity condition of a system. To exploit the sparsity of the system, a weighted l1-norm regularization is imposed on the cost function of the AP algorithm. Minimizing the cost function with a subgradient calculus and choosing two distinct weighting for l1-norm, two stochastic gradient based sparsity r...
متن کاملA Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملSparsity-aware Adaptive Filtering Algorithms and Application to System Identification
In this thesis, low-complexity adaptive filtering algorithms that exploit the sparsity of signals and systems are derived and investigated. Specifically, sparsity-aware normalized least-mean square and affine projection algorithms are developed based on the l1-norm incorporated to their cost function, which we term zero-attracting NLMS (ZA-NLMS) and zero-attracting APA (ZA-APA). These algorithm...
متن کاملAffine Projection Algorithm Applied to Nonlinear Adaptive Filtering
In this paper, we present a framework for nonlinear adaptive filtering. It employs the formalism of reproducing kernel Hilbert spaces to incorporate nonlinearity into the classical affine projection algorithm. A nonlinear normalized LMS (NLMS) algorithm with kernels is also derived as a particular case. We propose a sparsification strategy that employs a coherence parameter to control the model...
متن کاملGraph Regularized Within-Class Sparsity Preserving Projection for Face Recognition
As a dominant method for face recognition, the subspace learning algorithm shows desirable performance. Manifold learning can deal with the nonlinearity hidden in the data, and can project high dimensional data onto low dimensional data while preserving manifold structure. Sparse representation shows its robustness for noises and is very practical for face recognition. In order to extract the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2014
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e97.d.964